Study on Optimal Path Changing Tools in CNC Turret Typing Machine Based on Genetic Algorithm

نویسندگان

  • Min Liu
  • Xiaoling Ding
  • YinFa Yan
  • Xin Ci
چکیده

This paper is aimed to find the optimum path of CNC turret typing system to reduce the changing tools times and optimize tool movement routes to make up for the deficiency of CNC Turret Typing machine production efficiency. An uncertainty polynomial model is raised based on the asymmetric traveling salesman problem. And genetic algorithm (GA) is used to solve the path optimization problem. The optimization of path can minimize the moving tools times. Furthermore, the optimization problem is simplified to shortest distance between points. Fitness function, selection operator, crossover operator, mutation operator and other genetic operations are studied in this paper. In addition, the greedy crossover operator, the elite preservation strategy and the self-adaption strategy are imported in GA, which enhance the ability of finding the optimum and speed the efficiency. Finally, MATLAB simulation testifies that the algorithm is valid. The experiment result shows that the GA can shorten processing time and can reduce the air travel effectively without changing the machine's hardware through reasonable arrangement of the changing and moving tools path. As a result, the efficiency and precision of CNC turret typing system was improved availably.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Allocating optimal index positions on tool magazines using genetic algorithms

This paper presents an optimisation system software developed for the determination of optimal index positions of cutting tools on the automatic tool changer (ATC) or turret magazine of CNC machine tools. Position selection is performed using a genetic algorithm (GA) which takes a list of cutting tools assigned to certain machining operations together with total number of index positions availa...

متن کامل

Feed optimization for five-axis CNC machine tools with drive constraints

Real time control of five-axis machine tools requires smooth generation of feed, acceleration and jerk in CNC systems without violating the physical limits of the drives. This paper presents a feed scheduling algorithm for CNC systems to minimize the machining time for five-axis contour machining of sculptured surfaces. The variation of the feed along the five-axis tool-path is expressed in a c...

متن کامل

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

متن کامل

Optimal Path Diagnosis by Genetic Algorithm for NoCs

Nowadays Network-on-Chips is used instead of System-on-Chips for better performance. This paper presents a new algorithm to find a shorter path, and shows that genetic algorithm is a potential technique for solving routing problem for mesh topology in on-chip-network.

متن کامل

Optimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms

Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010